منابع مشابه
Interval Sequences: Manage Spatial Data Efficiently in Your Relational Database
The design of external access methods for spatially extended objects has been a long and well studied subject. As todays database applications show a growing demand for efficient management and retrieval of spatial data, a seamless and robust integration of spatial index structures into industrial-strength database systems now becomes more and more important. We propose an efficient, dynamic, s...
متن کاملRealizing Degree Sequences in Parallel
A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the components of d are equal to the degrees of the vertices of G. The graph G is said to be a realization of d. We provide an efficient parallel algorithm to realize d; the algorithm runs in O(logn) time using O(n+m) CRCW PRAM processors, where n and m are the number of vertices and edges in G. Before ou...
متن کاملRealizing degree sequences as Z3-connected graphs
An integer-valued sequence π = (d1, . . . , dn) is graphic if there is a simple graph G with degree sequence of π . We say the π has a realization G. Let Z3 be a cyclic group of order three. A graph G is Z3-connected if for every mapping b : V (G) → Z3 such that v∈V (G) b(v) = 0, there is an orientation of G and amapping f : E(G) → Z3−{0} such that for each vertex v ∈ V (G), the sum of the va...
متن کاملEfficiently determining Convergence in Polynomial Recurrence Sequences
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approa...
متن کاملMining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the properties of minimal occurrences and design effective pruning techniques to prune non-closed episodes. An efficient mining algorithm Clo_episode is proposed to mine all closed episodes following a breadth-first sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/20m1326489